Spacecraft Constrained Maneuver Planning Using Positively Invariant Constraint Admissible Sets (postprint)

نویسندگان

  • Morgan Baldwin
  • PAUL HAUSGEN
  • Ilya Kolmanovsky
چکیده

The paper considers spacecraft motion planning based on the use of safe positively invariant sets. In this approach, a connectivity graph is constructed between a set of forced equilibria, forming a virtual net that is centered around a nominal orbital position. The connectivity between two equilibria is determined based on safe positively invariant sets in order to guarantee that transitions between equilibria can be effected while spacecraft actuator limits are adhered to and debris collisions are avoided. A graph search algorithm is implemented to find the shortest path around the debris. Simulation results are presented that illustrate this approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spacecraft Constrained Maneuver Planning for Moving Debris Avoidance Using Positively Invariant Constraint Admissible Sets (postprint)

This paper extends our prior work on spacecraft debris avoidance based on positively invariant sets to the case of moving debris. In this approach, a timevarying connectivity graph is constructed between a set of forced equilibria, forming a virtual net that is centered around a nominal orbital position of the spacecraft. The connectivity between two equilibria is determined based on contractiv...

متن کامل

Robust Optimal Control of Flexible Spacecraft During Slewing Maneuvers

In this paper, slewing maneuver of a flexible spacecraft with large angle of rotation is considered and assuming structural frequency uncertainties a robust minimum-time optimal control law is developed. Considering typical bang-bang control commands with multiple symmetrical switches, a parameter optimization procedure is introduced to find the control forces/torques. The constrained minimizat...

متن کامل

Constraint-Admissible Set for Linear Discrete-time System with Chance Constraints

Constraint-admissible sets have been widely used in the study of control of systems with hard constraints. This paper proposes a generalization of the maximal constraint admissible set for constrained linear discrete time system to the case where chance or probabilistic constraints are present. Defined in the most obvious way, the maximal probabilistic constraint-admissible set is not invariant...

متن کامل

Invariance in Constrained Switching

We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general setting, a switching sequence is admissible if it is accepted by an automaton. For this family of systems, stability does not necessarily imply the existence of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012